Algebraic independence in an infinite Steiner triple system.
نویسندگان
چکیده
منابع مشابه
Isomorphisms of Infinite Steiner Triple Systems
An infinite countable Steiner triple system is called universal if any countable Steiner triple system can be embedded into it. The main result of this paper is the proof of non-existence of a universal Steiner triple system. The fact is proven by constructing a family S of size 2 of infinite countable Steiner triple systems so that no finite Steiner triple system can be embedded into any of th...
متن کاملPerfect countably infinite Steiner triple systems
We use a free construction to prove the existence of perfect Steiner triple systems on a countably infinite point set. We use a specific countably infinite family of partial Steiner triple systems to start the construction, thus yielding 2א0 non-isomorphic perfect systems.
متن کاملIsomorphisms of Infinite Steiner Triple Systems II
A combinatorial method in conjuction with the results presented in [F] is introduced to prove that for any infinite cardinal κ, and every cardinal λ, 0≤λ≤κ, there are 2 mutually non-isomorphic Steiner triple systems of size κ that admit exactly 2 automorphisms. In particular, there are 2 mutually non-isomorphic rigid Steiner triple systems of size κ.
متن کاملConfigurations in Steiner triple systems
" Combinatorial Designs and their Applications " c 1999 (copyright owner as specified in the book).
متن کاملIn Exaclty One Triple of T. from a Steiner Triple System We Derive a Graph the Cardinality of a Minimum Cover for a Steiner Triple System Deened On
Test case generators and computational results for the maximum clique problem. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles. A strong cutting plane/branch-and-bound algorithm for node packing. A probabilistic heuristic for a computa-tionally diicult set covering problem. Two computation-ally diicult set covering problems that arise in computing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1967
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093956244